Elementary symmetric polynomials in Shamir's scheme
نویسندگان
چکیده
منابع مشابه
Advanced Elementary Symmetric Polynomials Calculation Algorithm
The main objective of this article is to construct a totally new, effective algorithm, for the calculations of all series of elementary symmetric polynomials at once for the arbitrary order of the general polynomial. We proved that the effectiveness of the advanced algorithm proposed in this article is by the linear term better than the algorithms existing in the literature so far. Moreover, we...
متن کاملComputing Elementary Symmetric Polynomials with a Sublinear Number of Multiplications
Elementary symmetric polynomials S n are used as a benchmark for the boundeddepth arithmetic circuit model of computation. In this work we prove that S n modulo composite numbersm = p1p2 can be computed with much fewer multiplications than over any field, if the coefficients of monomials xi1xi2 · · ·xik are allowed to be 1 either mod p1 or mod p2 but not necessarily both. More exactly, we prove...
متن کاملOn hyperbolicity cones associated with elementary symmetric polynomials
Elementary symmetric polynomials can be thought of as derivative polynomials of En(x) = ∏ i=1,...,n xi. Their associated hyperbolicity cones give a natural sequence of relaxations for R+. We establish a recursive structure for these cones, namely, that the coordinate projections of these cones are themselves hyperbolicity cones associated with elementary symmetric polynomials. As a consequence ...
متن کاملOn a crossroad of resampling plans: bootstrapping elementary symmetric polynomials
We investigate the validity of the bootstrap method for the elementary symmetric polynomials S both xed and increasing order k, as n ! 1 the cases where = EX 1 6 = 0, the nondegenerate case, and where = EX 1 = 0, the degenerate case, are considered.
متن کاملThe Shifted Partial Derivative Complexity of Elementary Symmetric Polynomials
We continue the study of the shifted partial derivative measure, introduced by Kayal (ECCC 2012), which has been used to prove many strong depth-4 circuit lower bounds starting from the work of Kayal, and that of Gupta et al. (CCC 2013). We show a strong lower bound on the dimension of the shifted partial derivative space of the Elementary Symmetric Polynomials of degree d in N variables for d ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Number Theory
سال: 2010
ISSN: 0022-314X
DOI: 10.1016/j.jnt.2010.02.009